Analysis and optimization of inner products for mimetic finite difference methods on a triangular grid
نویسندگان
چکیده
The support operator method designs mimetic finite difference schemes by first constructing a discrete divergence operator based on the divergence theorem, and then defining the discrete gradient operator as the adjoint operator of the divergence based on the Gauss theorem connecting the divergence and gradient operators, which remains valid also in the discrete case. When evaluating the discrete gradient operator, one needs to define discrete inner products of two discrete vector fields. The local discrete inner product on a given triangle is defined by a 3 × 3 symmetric positive definite matrix M defined by its six independent elements–parameters. Using the Gauss theorem over our triangle, we evaluate the discrete gradient in the triangle. We require the discrete gradient to be exact for linear functions, which gives us a system of linear equations for elements of the matrix M. This system, together with inequalities which guarantee positive definiteness of the matrix M, results in a one parameter family of inner products which give exact gradients for linear functions. The traditional inner product is a member of this family. The positive free parameter can be used to improve another property of the discrete method. We show that accuracy of the method for quadratic functions improves with decreasing this parameter, however, at the same time, the condition number of the matrix M, which is the local matrix of the linear system for computing the discrete gradient, increases to infinity when the parameter goes to zero, so one needs to choose a compromise between accuracy and solvability of the local system. Our analysis has been performed by computer algebra tools which proved to be essential. © 2004 Published by Elsevier B.V. on behalf of IMACS. PACS: 02.30.Jr; 02.60.Lj; 02.70.Bf
منابع مشابه
A Node Reconnection Algorithm for Mimetic Finite Difference Discretizations of Elliptic Equations on Triangular Meshes
Most efficient adaptive mesh methods employ only a few strategies, including local mesh refinement (h-adaptation), movement of mesh nodes (r-adaptation), and node reconnection (c-adaptation). Despite of its simplicity, node reconnection is the least popular of the three. However, using only node reconnection the discretization error can be significantly reduced. In this paper, we develop and nu...
متن کاملModified Fixed Grid Finite Element Method in the Analysis of 2D Linear Elastic Problems
In this paper, a modification on the fixed grid finite element method is presented and used in the solution of 2D linear elastic problems. This method uses non-boundary-fitted meshes for the numerical solution of partial differential equations. Special techniques are required to apply boundary conditions on the intersection of domain boundaries and non-boundary-fitted elements. Hence, a new met...
متن کاملConvergence Analysis of the mimetic Finite Difference Method for Elliptic Problems with Staggered Discretizations of Diffusion Coefficients
We propose a family of mimetic discretization schemes for elliptic problems including convection and reaction terms. Our approach is an extension of the mimetic methodology for purely diffusive problems on unstructured polygonal and polyhedral meshes. The a priori error analysis relies on the connection between the mimetic formulation and the lowest order Raviart–Thomas mixed finite element met...
متن کاملModified Fixed Grid Finite Element Method in the Analysis of 2D Linear Elastic Problems
In this paper, a modification on the fixed grid finite element method is presented and used in the solution of 2D linear elastic problems. This method uses non-boundary-fitted meshes for the numerical solution of partial differential equations. Special techniques are required to apply boundary conditions on the intersection of domain boundaries and non-boundary-fitted elements. Hence, a new met...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematics and Computers in Simulation
دوره 67 شماره
صفحات -
تاریخ انتشار 2004